Sufficient Conditions for Extracting Least Cost Resource First
نویسندگان
چکیده
منابع مشابه
Sufficient conditions for univalence and starlikeness
It is known that the condition $mathfrak {Re} left{zf'(z)/f(z)right}>0$, $|z|
متن کاملSufficient Conditions for Nonempty Core of Minimum Cost Forest Games
This paper studies problems of establishing a minimum cost network and of determining a fair cost allocation among customers. Each supplier offers a different type of service to the customers, and each customer wishes to be connected with the suppliers which he needs. The characteristic function game is deduced from minimum costs for constructing subnetworks. By introducing an equivalence relat...
متن کاملSufficient Conditions for First-Order and Datalog Rewritability in ELU
We study the problem of answering instance queries over non-Horn ontologies by rewriting them into Datalog programs or FirstOrder queries (FOQs). We consider the basic non-Horn language ELU , which extends EL with disjunctions. Both Datalog-rewritability and FOrewritability of instance queries have been recently shown to be decidable for ALC ontologies (and hence also for ELU); however, existin...
متن کاملCERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS
The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 1982
ISSN: 0012-9682
DOI: 10.2307/1912779